Phase diagram of the one-dimensionalS=12XXZmodel with ferromagnetic nearest-neighbor and antiferromagnetic next-nearest-neighbor interactions
نویسندگان
چکیده
منابع مشابه
Influence of nearest-neighbor Coulomb interactions on the phase diagram of the ferromagnetic Kondo model
The influence of a nearest-neighbor Coulomb repulsion of strength V on the properties of the ferromagnetic Kondo model is analyzed using computational techniques. The Hamiltonian studied here is defined on a chain using localized S51/2 spins, and one orbital per site. Special emphasis is given to the influence of the Coulomb repulsion on the regions of phase separation recently discovered in th...
متن کاملPhase diagram of the XXZ chain with next-nearest-neighbor interactions
We calculate the quantum phase diagram of the XXZ chain with nearestneighbor (NN) J1 and next-NN exchange J2 with anisotropies ∆1 and ∆2 respectively. In particular we consider the case ∆1 = −∆2 to interpolate between the XX chain (∆i = 0) and the isotropic model with ferromagnetic J2. For ∆1 < −1, a ferromagnetic and two antiferromagnetic phases exist. For |∆i| < 1, the boundary between the di...
متن کاملEFFECT OF THE NEXT-NEAREST NEIGHBOR INTERACTION ON THE ORDER-DISORDER PHASE TRANSITION
In this work, one and two-dimensional lattices are studied theoretically by a statistical mechanical approach. The nearest and next-nearest neighbor interactions are both taken into account, and the approximate thermodynamic properties of the lattices are calculated. The results of our calculations show that: (1) even though the next-nearest neighbor interaction may have an insignificant ef...
متن کاملRenormalization Group Studies of Antiferromagnetic Chains I . * Nearest - Neighbor Interactions
The SLAC real-space renormalization group method is used to study one-dimensional antiferromagnetic chains at zero temperature. Calculations using three-site blocks (for the Heisenberg-Ising model) and two-site blocks (for the isotropic Heisenberg model) are compared with exact results. In connection with the two-site calculation a duality transformation is introduced under which the isotropic ...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2007
ISSN: 1098-0121,1550-235X
DOI: 10.1103/physrevb.76.014412